Single-Machine Maintenance Activity Scheduling with Convex Resource Constraints and Learning Effects

In this paper, the single-machine scheduling problems under common and slack due date assignments are studied, where actual processing time of job needs to consider some factors, such as convex resource allocation, maintenance activity, learning effects. The goal study is find optimal sequence, activity location, allocation (flow allowance). objective function (1) minimize sum cost (including weighted earliness, tardiness allowance), weights position-dependent weights) consumption cost, (2) which bounded. We prove that these can be solved in polynomial time.